Semantics of First Order Belief RevisionBased on Circumscription
نویسنده
چکیده
The AGM postulates for knowledge base revision are a set of rationality postulates that revision operations on knowledge systems should satisfy. Deening an appropriate semantics for belief revision that satisses all of the postulates has been considered a challenging problem. In this paper we present a novel application of circumscription to deening a semantics of belief revision systems. First, a rst-order knowledge base is represented by a set of formulas in a rst order epistemic belief language that contains objective propositions as well as belief propositions. Secondly, we deene a revision semantics by applying a form of priority circumscription to the belief representation of the knowledge base. We prove that the semantics deened in this way satisses the AGM postulates that are reformulated in our belief language.
منابع مشابه
Knowledge Base Revision Using Circumscription
In this paper we present a framework of retrospective reasoning to deal with the belief revision problem in knowledge systems. First, a rst-order knowledge base is represented by a set of formulas in a rst order epistemic belief language that contains objective formulas as well as belief formulas. Secondly, we deene the revision operation by applying a form of prioritized circumscription to thi...
متن کاملFirst-Order Semantics of Aggregates in Answer Set Programming Via Modified Circumscription
We provide reformulations and generalizations of both the semantics of logic programs by Faber, Leone and Pfeifer and its extension to arbitrary propositional formulas by Truszczyński. Unlike the previous definitions, our generalizations refer neither to grounding nor to fixpoints, and apply to first-order formulas containing aggregate expressions. Similar to the first-order stable model semant...
متن کاملDecidable Fragments of First-Order Language Under Stable Model Semantics and Circumscription
The stable model semantics was recently generalized by Ferraris, Lee and Lifschitz to the full first-order language with a syntax translation approach that is very similar to McCarthy’s circumscription. In this paper, we investigate the decidability and undecidability of various fragments of first-order language under both semantics of stable models and circumscription. Some maximally decidable...
متن کاملIntegrating Rules and Description Logics by Circumscription
We present a new approach to characterizing the semantics for the integration of rules and first-order logic in general, and description logics in particular, based on a circumscription characterization of answer set programming, introduced earlier by Lin and Zhou. We show that both Rosati’s semantics based on NM-models and Lukasiewicz’s answer set semantics can be characterized by circumscript...
متن کاملComputing General First-Order Parallel and Prioritized Circumscription
This paper focuses on computing general first-order parallel and prioritized circumscription with varying constants. We propose linear translations from general first-order circumscription to first-order theories under stable model semantics over arbitrary structures, including Trv for parallel circumscription and Tr v for conjunction of parallel circumscriptions (further for prioritized circum...
متن کامل